Note on F-Graph Construction
نویسندگان
چکیده
The center of an F-graph contains at least two vertices, and the distance between any central vertices is equal to radius. In this short note, we describe one way constructing these graphs.
منابع مشابه
Note on Bipartite Graph Tilings
Let s < t be two fixed positive integers. We determine sufficient minimum degree conditions for a bipartite graph G, with both color classes of size n = k(s + t), which ensure that G has a Ks,t-factor. Our result extends the work of Zhao, who determined the minimum degree threshold which guarantees that a bipartite graph has a Ks,s-factor.
متن کاملA Note on Graph Pebbling
We say that a graph G is Class 0 if its pebbling number is exactly equal to its number of vertices. For a positive integer d, let kðdÞ denote the least positive integer so that every graph G with diameter at most d and connectivity at least kðdÞ is Class 0. The existence of the function k was conjectured by Clarke, Hochberg and Hurlbert, who showed that if the function k exists, then it must sa...
متن کاملA note on graph reconstruction
Suppose G and G′ are graphs on the same vertex set V such that for each x ∈ V there is an isomorphism θx of G−x to G′−x. We prove in this paper that if there is a vertex x ∈ V and an automorphism σ of G − x such that θx agrees with σ on all except for at most three vertices of V −x, then G is isomorphic to G′. As a corollary we prove that if a graph G has a vertex which is contained in at most ...
متن کاملA note on the order graph of a group
The order graph of a group $G$, denoted by $Gamma^*(G)$, is a graph whose vertices are subgroups of $G$ and two distinct vertices $H$ and $K$ are adjacent if and only if $|H|big{|}|K|$ or $|K|big{|}|H|$. In this paper, we study the connectivity and diameter of this graph. Also we give a relation between the order graph and prime graph of a group.
متن کاملA Note on a graph associated to a commutative ring
The rings considered in this article are commutative with identity. This article is motivated by the work on comaximal graphs of rings. In this article, with any ring $R$, we associate an undirected graph denoted by $G(R)$, whose vertex set is the set of all elements of $R$ and distinct vertices $x,y$ are joined by an edge in $G(R)$ if and only if $Rxcap Ry = Rxy$. In Section 2 of this articl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computation (Basel)
سال: 2021
ISSN: ['2079-3197']
DOI: https://doi.org/10.3390/computation9070074